Bertrand Numeration Systems and Recognizability
نویسندگان
چکیده
There exist various well-known characterizations of sets of numbers recognizable by a nite automaton, when they are represented in some integer base p 2. We show how to modify these characterizations, when integer bases p are replaced by linear numeration systems whose characteristic polynomial is the minimal polynomial of a Pisot number. We also prove some related interesting properties.
منابع مشابه
Numeration systems on a regular language: arithmetic operations, recognizability and formal power series
Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L ⊂ Σ∗. For these systems, we obtain a characterization of recognizable sets of integers in terms of rational formal series. We also show that, if the complexity of L is Θ(n) (resp. if L is the complement of a polynomial language...
متن کاملAbstract numeration systems on bounded languages and multiplication by a constant
numeration systems on bounded languages and multiplication by a constant Emilie Charlier, Michel Rigo, Wolfgang Steiner 1 Institute of Mathematics, University of Liège, Grande Traverse 12 (B 37), B-4000 Liège, Belgium. {echarlier,M.Rigo}@ulg.ac.be 2 LIAFA, CNRS, University Paris Diderot, case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France, [email protected] Abstract. A set of inte...
متن کاملSome results about numeration systems on a regular language : Formal power series and Multiplication by a constant in the polynomial case
Generalizations of numeration systems in which N is recognizable by finite automata are obtained by describing a lexicographically ordered infinite regular language. For these systems of numeration, we obtain a characterization of the recognizable sets of integers in terms of rational formal series. We also show that, for a numeration system constructed on a regular language of density in Θ(n),...
متن کاملNumeration Systems on Bounded Languages and Multiplication by a Constant
NUMERATION SYSTEMS ON BOUNDED LANGUAGES AND MULTIPLICATION BY A CONSTANT Emilie Charlier Institute of Mathematics, University of Liège, Grande Traverse 12 (B 37), B–4000 Liège, Belgium [email protected] Michel Rigo Institute of Mathematics, University of Liège, Grande Traverse 12 (B 37), B–4000 Liège, Belgium [email protected] Wolfgang Steiner LIAFA, CNRS, Université Paris Diderot – Paris 7, c...
متن کاملTHE MINIMAL AUTOMATON RECOGNIZING mN IN A LINEAR NUMERATION SYSTEM
We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component and the form of any such additional components. Our characterization applies, in particular, to any automaton arising from a Bertrand numeration system. Furthermore, we show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 181 شماره
صفحات -
تاریخ انتشار 1997